Three classes of decomposable distributions
نویسندگان
چکیده
منابع مشابه
Approximating discrete probability distributions with decomposable models
A heuristic procedure is presented to approximate an 71dimensional discrete probability distribution with a decomposable model of a given complexity. It is shown that, without loss of generality, the search space can be restricted to a suitable subclass of decomposable models, whose members are called elementary models. The selected elementary model is constructed in an incremental manner accor...
متن کاملIncome distributions and decomposable divergence measures
Inequality indices (i) evaluate the divergence between the income distribution and the hypothetical situation where all individuals have the mean income and (ii) are unambiguously reduced by a Pigou-Dalton progressive transfer. This paper proposes a new approach to evaluate the divergence between any two income distributions, where the second one can be a reference distribution for the first. I...
متن کاملOptimizing Non-decomposable Performance Measures: A Tale of Two Classes
Modern classification problems frequently present mild to severe label imbalance as well as specific requirements on classification characteristics, and require optimizing performance measures that are non-decomposable over the dataset, such as F-measure. Such measures have spurred much interest and pose specific challenges to learning algorithms since their non-additive nature precludes a dire...
متن کاملOptimizing Non-decomposable Performance Measures: A Tale of Two Classes
Lemma 3. The stability parameter of a performance measure Ψ(·) can be written as δ() ≤ L Ψ · iff its sufficient dual region is bounded in a ball of radius Θ (L Ψ). Proof. Let us denote primal variables using the notation x = (u, v) and dual variables using the notation θ = (α, β). The proof follows from the fact that any value of θ for which Ψ * (θ) = −∞ can be safely excluded from the sufficie...
متن کاملEfficient approximation of probability distributions with k-order decomposable models
During the last decades several learning algorithms have been proposed to learn probability distributions based on decomposable models. Some of these algorithms can be used to search for a maximum likelihood decomposable model with a given maximum clique size, k. Unfortunately, the problem of learning a maximum likelihood decomposable model given a maximum clique size is NP-hard for k > 2. In t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Open Mathematics
سال: 2020
ISSN: 2391-5455
DOI: 10.1515/math-2020-0124